A Logical Framework with Explicit Conversions
نویسندگان
چکیده
منابع مشابه
A Logical Framework with Explicit Conversions
The type theory λP corresponds to the logical framework LF. In this paper we present λH, a variant of λP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a λH term is proportional to the size of the term itself. We define an erasure map from λH to λP , and show t...
متن کاملLogical Conversions
As I have argued elsewhere [10], and as summarized in the first two sections below, it turns out to be both logically and semantically revealing to acknowledge the existence of converse, or conversely construed, quantifiers, which mirror their classical, or classically construed, counterparts. In this paper I argue that classically construed quantifiers in their turn mirror their conversely con...
متن کاملA Logical Relations for a Logical Framework
Logical relations are a central concept used to study various higher-order type theories and occur frequently in the proofs of a wide variety of meta-theorems. Besides extending the logical relation principle to more general languages, an important research question has been how to represent and thus verify logical relation arguments in logical frameworks. We formulate a theory of logical relat...
متن کاملvalidation of a revised logical-mathematical intelligence scale and exploring its relationship with english language proficiency
نظریه هوش چندگانه قسمتهای متفاوت هوش بشری را مورد بررسی قرار می دهد که با شناخت آن شخص به درک بهتری از توانایی های خود میرسد و در نتیجه سعی در استفاده از آن جهت یادگیری بهتر میکند. همچنین با شناخت استعداد دانش آموزان، فرایند یادگیری بهتر میشود. هدف از انجام دادن این تحقیق بررسی رابطه بین هوش ریاضی و استعداد یادگیری زبان انگلیسی میباشد. برای انجام این تحقیق از پرسشنامه هوش ریاضی که توسط شیرر در ...
A Logical Framework with Dependently Typed Records
Our long term goal is a system to formally represent complex structured mathematical objects, and proofs and computation on such objects; e.g. a foundational computer algebra system. Our approach is informed by the long development of module systems for functional programming based on dependent record types as signatures [20]. For our logical purposes, however, we want a dependently typed base ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.11.011